Property - based Synthesis of Optimized Büchi Automata ( Deliverable
نویسندگان
چکیده
Dissemination Level PU Public ⊠ PP Restricted to other programme participants (including the Commission Services) RE Restricted to a group specified by the consortium (including the Commission Services) CO Confidential, only for members of the consortium (including the Commission Services) Notices For information, contact Roderick Bloem [email protected]. This document is intended to fulfil the contractual obligations of the PROSYD project concerning deliverable 3.2/10 described in contract number 507219. The information in this document is provided " as is " , and no guarantee or warranty is given that the information is fit for any particular purpose. The user thereof uses the information at its sole risk and liability. In this deliverable we present an implementation of an optimized PSL automata construction. With our tool a designer can derive alternating and nondetermin-istic explicit automata from PSL formulae. Furthermore our tool offers the option of deriving a symbolic representation in the SMV format (used e.g. by the NuSMV [10] model checker) using a new approach we presented at the 11th International Conference on Implementation and Application of Automata, 2006 in [8]. We performed extensive experiments with our optimizations and symbolic representations, shown in [8]. We give installation instructions in Section 2. In Section 3 we give available syntax and options. Then, in Section 4 we give the technical details of the syntax translation and automata synthesis optimizations implemented. Finally we draw conclusions in Section 5. Purpose This document describes the implementation of our tool for synthesizing optimized Büchi automata from PSL properties. Intended Audience This document is aimed at people who want to build Büchi automata for PSL properties. This includes people using formal verification as well as engineers from the Electronic Design Automation (EDA) industry or scientific community working on tools for formal verification.
منابع مشابه
Sequential Synthesis with Co-Büchi Specifications
Computations are developed for the synthesis of a finite state machine (FSM) embedded in a known FSM such that their combined behavior satisfies a co-Büchi specification (the solution must finally enter an acceptable set of states and stay there forever). The procedures for this are shown to be very similar to those used for regular (non-omega) automata, except for a final step in which a set o...
متن کاملBüchi Complementation and Size-Change Termination
We compare tools for complementing nondeterministic Büchi automata with a recent termination-analysis algorithm. Complementation of Büchi automata is a key step in program verification. Early constructions using a Ramsey-based argument have been supplanted by rank-based constructions with exponentially better bounds. In 2001 Lee et al. presented the size-change termination (SCT) problem, along ...
متن کاملStrength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking
The automata-theoretic approach for model checking of lineartime temporal properties involves the emptiness check of a large Büchi automaton. Specialized emptiness-check algorithms have been proposed for the cases where the property is represented by a weak or terminal automaton. When the property automaton does not fall into these categories, a general emptiness check is required. This paper f...
متن کاملLinear weak alternating automata and the model checking problem
Abstract. Automata-based model checking is a widely used approach towards software model checking. Traditionally, nondeterministic Büchi automata are used to represent the temporal logic property to be checked. We take a look at a special kind of alternating automata, the linear weak alternating automata. They can be constructed from LTL formula in an elegant way in linear time. The emptiness c...
متن کاملOn-the-fly Emptiness Check of Transition-Based Streett Automata
In the automata theoretic approach to model checking, checking a state-space S against a linear-time property φ can be done in O(|S| × 2) time. When model checking under n strong fairness hypotheses expressed as a Generalized Büchi automaton, this complexity becomes O(|S| × 2). Here we describe an algorithm to check the emptiness of Streett automata, which allows model checking under n strong f...
متن کامل